<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
<html xmlns="http://www.w3.org/1999/xhtml">
<head>
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
<meta http-equiv="X-UA-Compatible" content="IE=9"/>
<meta name="generator" content="Doxygen 1.8.14"/>
<meta name="viewport" content="width=device-width, initial-scale=1"/>
<title>SPHinXsys: SPH::Node Class Reference</title>
<link href="tabs.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="jquery.js"></script>
<script type="text/javascript" src="dynsections.js"></script>
<link href="search/search.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="search/searchdata.js"></script>
<script type="text/javascript" src="search/search.js"></script>
<link href="doxygen.css" rel="stylesheet" type="text/css" />
</head>
<body>
<div id="top"><!-- do not remove this div, it is closed by doxygen! -->
<div id="titlearea">
<table cellspacing="0" cellpadding="0">
 <tbody>
 <tr style="height: 56px;">
  <td id="projectlogo"><img alt="Logo" src="logo.png"/></td>
  <td id="projectalign" style="padding-left: 0.5em;">
   <div id="projectname">SPHinXsys
   &#160;<span id="projectnumber">alpha version</span>
   </div>
  </td>
 </tr>
 </tbody>
</table>
</div>
<!-- end header part -->
<!-- Generated by Doxygen 1.8.14 -->
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
var searchBox = new SearchBox("searchBox", "search",false,'Search');
/* @license-end */
</script>
<script type="text/javascript" src="menudata.js"></script>
<script type="text/javascript" src="menu.js"></script>
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
$(function() {
  initMenu('',true,false,'search.php','Search');
  $(document).ready(function() { init_search(); });
});
/* @license-end */</script>
<div id="main-nav"></div>
<!-- window showing the filter options -->
<div id="MSearchSelectWindow"
     onmouseover="return searchBox.OnSearchSelectShow()"
     onmouseout="return searchBox.OnSearchSelectHide()"
     onkeydown="return searchBox.OnSearchSelectKey(event)">
</div>

<!-- iframe showing the search results (closed by default) -->
<div id="MSearchResultsWindow">
<iframe src="javascript:void(0)" frameborder="0" 
        name="MSearchResults" id="MSearchResults">
</iframe>
</div>

<div id="nav-path" class="navpath">
  <ul>
<li class="navelem"><a class="el" href="namespace_s_p_h.html">SPH</a></li><li class="navelem"><a class="el" href="class_s_p_h_1_1_node.html">Node</a></li>  </ul>
</div>
</div><!-- top -->
<div class="header">
  <div class="summary">
<a href="#pub-methods">Public Member Functions</a> &#124;
<a href="#pub-attribs">Public Attributes</a> &#124;
<a href="class_s_p_h_1_1_node-members.html">List of all members</a>  </div>
  <div class="headertitle">
<div class="title">SPH::Node Class Reference</div>  </div>
</div><!--header-->
<div class="contents">

<p>A class containing the nodes of the branches plus some fuctions to compute distance related quantities.  
 <a href="class_s_p_h_1_1_node.html#details">More...</a></p>

<p><code>#include &lt;<a class="el" href="network_8h_source.html">network.h</a>&gt;</code></p>
<table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="pub-methods"></a>
Public Member Functions</h2></td></tr>
<tr class="memitem:a2f80b789ee3c27bad5e7da9788038da7"><td class="memItemLeft" align="right" valign="top">&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="class_s_p_h_1_1_node.html#a2f80b789ee3c27bad5e7da9788038da7">Node</a> (Point init_node)</td></tr>
<tr class="separator:a2f80b789ee3c27bad5e7da9788038da7"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a2efe80467633b80d3fe4f9989b9e7703"><td class="memItemLeft" align="right" valign="top">std::vector&lt; <a class="el" href="classint.html">int</a> &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="class_s_p_h_1_1_node.html#a2efe80467633b80d3fe4f9989b9e7703">addNode</a> (std::vector&lt; Point &gt; &amp;pts)</td></tr>
<tr class="memdesc:a2efe80467633b80d3fe4f9989b9e7703"><td class="mdescLeft">&#160;</td><td class="mdescRight">This function stores a list of nodes of a branch and returns the node indices. It also updates the tree to compute distances.  <a href="#a2efe80467633b80d3fe4f9989b9e7703">More...</a><br /></td></tr>
<tr class="separator:a2efe80467633b80d3fe4f9989b9e7703"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a4358f3e5911e4339368ae3288fa22f94"><td class="memItemLeft" align="right" valign="top">Real&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="class_s_p_h_1_1_node.html#a4358f3e5911e4339368ae3288fa22f94">getDistanceFromPoint</a> (Point pt)</td></tr>
<tr class="memdesc:a4358f3e5911e4339368ae3288fa22f94"><td class="mdescLeft">&#160;</td><td class="mdescRight">Ths function returns the distance from any point to the closest node in the tree. param[in] pt the point to calculate the distance from.  <a href="#a4358f3e5911e4339368ae3288fa22f94">More...</a><br /></td></tr>
<tr class="separator:a4358f3e5911e4339368ae3288fa22f94"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a25e97c54178946fea721b92bd358e5aa"><td class="memItemLeft" align="right" valign="top">Real&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="class_s_p_h_1_1_node.html#a25e97c54178946fea721b92bd358e5aa">getDistanceFromNode</a> (<a class="el" href="classint.html">int</a> node_idx)</td></tr>
<tr class="memdesc:a25e97c54178946fea721b92bd358e5aa"><td class="mdescLeft">&#160;</td><td class="mdescRight">This function returns the distance from any node to the closest node in the tree.  <a href="#a25e97c54178946fea721b92bd358e5aa">More...</a><br /></td></tr>
<tr class="separator:a25e97c54178946fea721b92bd358e5aa"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:aee35c4e1aeb6156301e1e46a9fd219e2"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="class_s_p_h_1_1_node.html#aee35c4e1aeb6156301e1e46a9fd219e2">updateCollisionTree</a> (std::vector&lt; <a class="el" href="classint.html">int</a> &gt; &amp;exclude_nodes)</td></tr>
<tr class="memdesc:aee35c4e1aeb6156301e1e46a9fd219e2"><td class="mdescLeft">&#160;</td><td class="mdescRight">This function updates the collision_tree excluding a list of nodes from all the nodes in the tree. If all the existing nodes are excluded, one distant node is added.  <a href="#aee35c4e1aeb6156301e1e46a9fd219e2">More...</a><br /></td></tr>
<tr class="separator:aee35c4e1aeb6156301e1e46a9fd219e2"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a707625269856a9e9b81f798aff382408"><td class="memItemLeft" align="right" valign="top">Real&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="class_s_p_h_1_1_node.html#a707625269856a9e9b81f798aff382408">checkCollitionOnKDTree</a> (Point pnt)</td></tr>
<tr class="memdesc:a707625269856a9e9b81f798aff382408"><td class="mdescLeft">&#160;</td><td class="mdescRight">This function returns the distance from any node to the closest node in the tree.  <a href="#a707625269856a9e9b81f798aff382408">More...</a><br /></td></tr>
<tr class="separator:a707625269856a9e9b81f798aff382408"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:aafcf1410aaa3fb15cc9141dc8dccee1e"><td class="memItemLeft" align="right" valign="top">pointIndex&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="class_s_p_h_1_1_node.html#aafcf1410aaa3fb15cc9141dc8dccee1e">getCollisionNode</a> (Point pnt)</td></tr>
<tr class="memdesc:aafcf1410aaa3fb15cc9141dc8dccee1e"><td class="mdescLeft">&#160;</td><td class="mdescRight">This function returns the distance between one point and the closest node in the tree and the index of the closest node using the collision_tree.  <a href="#aafcf1410aaa3fb15cc9141dc8dccee1e">More...</a><br /></td></tr>
<tr class="separator:aafcf1410aaa3fb15cc9141dc8dccee1e"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a785d3acf5c333549e6a38217ef78c918"><td class="memItemLeft" align="right" valign="top">Vecd&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="class_s_p_h_1_1_node.html#a785d3acf5c333549e6a38217ef78c918">getGradient</a> (Point pt, Real delta)</td></tr>
<tr class="memdesc:a785d3acf5c333549e6a38217ef78c918"><td class="mdescLeft">&#160;</td><td class="mdescRight">This function returns the gradient of the distance from the existing points of the tree from any point. It uses a central finite difference approximation.  <a href="#a785d3acf5c333549e6a38217ef78c918">More...</a><br /></td></tr>
<tr class="separator:a785d3acf5c333549e6a38217ef78c918"><td class="memSeparator" colspan="2">&#160;</td></tr>
</table><table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="pub-attribs"></a>
Public Attributes</h2></td></tr>
<tr class="memitem:a18579b570d4f163829098c655350994b"><td class="memItemLeft" align="right" valign="top">std::vector&lt; Point &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="class_s_p_h_1_1_node.html#a18579b570d4f163829098c655350994b">nodes_</a></td></tr>
<tr class="separator:a18579b570d4f163829098c655350994b"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:abe8bf9d8d414f5896e58b1cb52fbdf42"><td class="memItemLeft" align="right" valign="top">std::vector&lt; <a class="el" href="classint.html">int</a> &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="class_s_p_h_1_1_node.html#abe8bf9d8d414f5896e58b1cb52fbdf42">nodes_idx_</a></td></tr>
<tr class="separator:abe8bf9d8d414f5896e58b1cb52fbdf42"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:aa6ee05ea3705bc945c4130229eeea9bc"><td class="memItemLeft" align="right" valign="top"><a class="el" href="classint.html">int</a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="class_s_p_h_1_1_node.html#aa6ee05ea3705bc945c4130229eeea9bc">last_node_</a></td></tr>
<tr class="separator:aa6ee05ea3705bc945c4130229eeea9bc"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:ace46ca6baedae3f8df436e5606c20caf"><td class="memItemLeft" align="right" valign="top"><a class="el" href="namespace_s_p_h.html#abae56fd7f25f13487c7943ce4681d0ce">IndexVector</a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="class_s_p_h_1_1_node.html#ace46ca6baedae3f8df436e5606c20caf">end_nodes_</a></td></tr>
<tr class="separator:ace46ca6baedae3f8df436e5606c20caf"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:aa7f2629949b9f07a0954146466ca782b"><td class="memItemLeft" align="right" valign="top"><a class="el" href="class_s_p_h_1_1_k_d_tree.html">KDTree</a> *&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="class_s_p_h_1_1_node.html#aa7f2629949b9f07a0954146466ca782b">kd_tree_</a></td></tr>
<tr class="separator:aa7f2629949b9f07a0954146466ca782b"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:aae88b07cfdc5092b4dd1099bb78d192c"><td class="memItemLeft" align="right" valign="top"><a id="aae88b07cfdc5092b4dd1099bb78d192c"></a>
<a class="el" href="class_s_p_h_1_1_k_d_tree.html">KDTree</a> *&#160;</td><td class="memItemRight" valign="bottom"><b>collision_kd_tree_</b></td></tr>
<tr class="separator:aae88b07cfdc5092b4dd1099bb78d192c"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:acea90d0decbe568165aa5b885d33e1eb"><td class="memItemLeft" align="right" valign="top"><a class="el" href="class_s_p_h_1_1_int_comparer.html">IntComparer</a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="class_s_p_h_1_1_node.html#acea90d0decbe568165aa5b885d33e1eb">comparer_</a></td></tr>
<tr class="separator:acea90d0decbe568165aa5b885d33e1eb"><td class="memSeparator" colspan="2">&#160;</td></tr>
</table>
<a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
<div class="textblock"><p>A class containing the nodes of the branches plus some fuctions to compute distance related quantities. </p>
</div><h2 class="groupheader">Constructor &amp; Destructor Documentation</h2>
<a id="a2f80b789ee3c27bad5e7da9788038da7"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a2f80b789ee3c27bad5e7da9788038da7">&#9670;&nbsp;</a></span>Node()</h2>

<div class="memitem">
<div class="memproto">
      <table class="memname">
        <tr>
          <td class="memname">SPH::Node::Node </td>
          <td>(</td>
          <td class="paramtype">Point&#160;</td>
          <td class="paramname"><em>init_node</em></td><td>)</td>
          <td></td>
        </tr>
      </table>
</div><div class="memdoc">
<p>Default constructor. </p>

</div>
</div>
<h2 class="groupheader">Member Function Documentation</h2>
<a id="a2efe80467633b80d3fe4f9989b9e7703"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a2efe80467633b80d3fe4f9989b9e7703">&#9670;&nbsp;</a></span>addNode()</h2>

<div class="memitem">
<div class="memproto">
      <table class="memname">
        <tr>
          <td class="memname">std::vector&lt; <a class="el" href="classint.html">int</a> &gt; SPH::Node::addNode </td>
          <td>(</td>
          <td class="paramtype">std::vector&lt; Point &gt; &amp;&#160;</td>
          <td class="paramname"><em>pts</em></td><td>)</td>
          <td></td>
        </tr>
      </table>
</div><div class="memdoc">

<p>This function stores a list of nodes of a branch and returns the node indices. It also updates the tree to compute distances. </p>
<dl class="params"><dt>Parameters</dt><dd>
  <table class="params">
    <tr><td class="paramdir">[in]</td><td class="paramname">pts</td><td>a list of arrays containing the coordinates of the nodes of one branch. </td></tr>
    <tr><td class="paramdir">[out]</td><td class="paramname">the</td><td>indices of the added nodes. </td></tr>
  </table>
  </dd>
</dl>

</div>
</div>
<a id="a707625269856a9e9b81f798aff382408"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a707625269856a9e9b81f798aff382408">&#9670;&nbsp;</a></span>checkCollitionOnKDTree()</h2>

<div class="memitem">
<div class="memproto">
      <table class="memname">
        <tr>
          <td class="memname">Real SPH::Node::checkCollitionOnKDTree </td>
          <td>(</td>
          <td class="paramtype">Point&#160;</td>
          <td class="paramname"><em>pnt</em></td><td>)</td>
          <td></td>
        </tr>
      </table>
</div><div class="memdoc">

<p>This function returns the distance from any node to the closest node in the tree. </p>
<dl class="params"><dt>Parameters</dt><dd>
  <table class="params">
    <tr><td class="paramdir">[in]</td><td class="paramname">node_idx</td><td>the index of the node to calculate the distance from. </td></tr>
    <tr><td class="paramdir">[out]</td><td class="paramname">the</td><td>distance between specified node and the closest node in the tree. </td></tr>
  </table>
  </dd>
</dl>

</div>
</div>
<a id="aafcf1410aaa3fb15cc9141dc8dccee1e"></a>
<h2 class="memtitle"><span class="permalink"><a href="#aafcf1410aaa3fb15cc9141dc8dccee1e">&#9670;&nbsp;</a></span>getCollisionNode()</h2>

<div class="memitem">
<div class="memproto">
      <table class="memname">
        <tr>
          <td class="memname">pointIndex SPH::Node::getCollisionNode </td>
          <td>(</td>
          <td class="paramtype">Point&#160;</td>
          <td class="paramname"><em>pnt</em></td><td>)</td>
          <td></td>
        </tr>
      </table>
</div><div class="memdoc">

<p>This function returns the distance between one point and the closest node in the tree and the index of the closest node using the collision_tree. </p>
<dl class="params"><dt>Parameters</dt><dd>
  <table class="params">
    <tr><td class="paramdir">[in]</td><td class="paramname">the</td><td>point to calculate the distance from. </td></tr>
    <tr><td class="paramdir">[out]</td><td class="paramname">(distance</td><td>to the closest node, index of the closest node) </td></tr>
  </table>
  </dd>
</dl>

</div>
</div>
<a id="a25e97c54178946fea721b92bd358e5aa"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a25e97c54178946fea721b92bd358e5aa">&#9670;&nbsp;</a></span>getDistanceFromNode()</h2>

<div class="memitem">
<div class="memproto">
      <table class="memname">
        <tr>
          <td class="memname">Real SPH::Node::getDistanceFromNode </td>
          <td>(</td>
          <td class="paramtype"><a class="el" href="classint.html">int</a>&#160;</td>
          <td class="paramname"><em>node_idx</em></td><td>)</td>
          <td></td>
        </tr>
      </table>
</div><div class="memdoc">

<p>This function returns the distance from any node to the closest node in the tree. </p>
<dl class="params"><dt>Parameters</dt><dd>
  <table class="params">
    <tr><td class="paramdir">[in]</td><td class="paramname">node_idx</td><td>the index of the node to calculate the distance from. </td></tr>
    <tr><td class="paramdir">[out]</td><td class="paramname">the</td><td>distance between specified node and the closest node in the tree. </td></tr>
  </table>
  </dd>
</dl>

</div>
</div>
<a id="a4358f3e5911e4339368ae3288fa22f94"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a4358f3e5911e4339368ae3288fa22f94">&#9670;&nbsp;</a></span>getDistanceFromPoint()</h2>

<div class="memitem">
<div class="memproto">
      <table class="memname">
        <tr>
          <td class="memname">Real SPH::Node::getDistanceFromPoint </td>
          <td>(</td>
          <td class="paramtype">Point&#160;</td>
          <td class="paramname"><em>pt</em></td><td>)</td>
          <td></td>
        </tr>
      </table>
</div><div class="memdoc">

<p>Ths function returns the distance from any point to the closest node in the tree. param[in] pt the point to calculate the distance from. </p>
<dl class="params"><dt>Parameters</dt><dd>
  <table class="params">
    <tr><td class="paramdir">[out]</td><td class="paramname">the</td><td>distance between point and the closest node in the tree. </td></tr>
  </table>
  </dd>
</dl>

</div>
</div>
<a id="a785d3acf5c333549e6a38217ef78c918"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a785d3acf5c333549e6a38217ef78c918">&#9670;&nbsp;</a></span>getGradient()</h2>

<div class="memitem">
<div class="memproto">
      <table class="memname">
        <tr>
          <td class="memname">Vecd SPH::Node::getGradient </td>
          <td>(</td>
          <td class="paramtype">Point&#160;</td>
          <td class="paramname"><em>pt</em>, </td>
        </tr>
        <tr>
          <td class="paramkey"></td>
          <td></td>
          <td class="paramtype">Real&#160;</td>
          <td class="paramname"><em>delta</em>&#160;</td>
        </tr>
        <tr>
          <td></td>
          <td>)</td>
          <td></td><td></td>
        </tr>
      </table>
</div><div class="memdoc">

<p>This function returns the gradient of the distance from the existing points of the tree from any point. It uses a central finite difference approximation. </p>
<dl class="params"><dt>Parameters</dt><dd>
  <table class="params">
    <tr><td class="paramdir">[in]</td><td class="paramname">pt</td><td>the point to calculate the gradient of the distance from. </td></tr>
    <tr><td class="paramdir">[out]</td><td class="paramname">gradient</td><td>of the distance. </td></tr>
  </table>
  </dd>
</dl>

</div>
</div>
<a id="aee35c4e1aeb6156301e1e46a9fd219e2"></a>
<h2 class="memtitle"><span class="permalink"><a href="#aee35c4e1aeb6156301e1e46a9fd219e2">&#9670;&nbsp;</a></span>updateCollisionTree()</h2>

<div class="memitem">
<div class="memproto">
      <table class="memname">
        <tr>
          <td class="memname">void SPH::Node::updateCollisionTree </td>
          <td>(</td>
          <td class="paramtype">std::vector&lt; <a class="el" href="classint.html">int</a> &gt; &amp;&#160;</td>
          <td class="paramname"><em>exclude_nodes</em></td><td>)</td>
          <td></td>
        </tr>
      </table>
</div><div class="memdoc">

<p>This function updates the collision_tree excluding a list of nodes from all the nodes in the tree. If all the existing nodes are excluded, one distant node is added. </p>
<dl class="params"><dt>Parameters</dt><dd>
  <table class="params">
    <tr><td class="paramdir">[in]</td><td class="paramname">branch_nodes</td><td>contains the nodes to exclude from the tree. Usually it should be the mother and the brother branch nodes. </td></tr>
  </table>
  </dd>
</dl>
<p>Update collision tree. </p>

</div>
</div>
<h2 class="groupheader">Member Data Documentation</h2>
<a id="acea90d0decbe568165aa5b885d33e1eb"></a>
<h2 class="memtitle"><span class="permalink"><a href="#acea90d0decbe568165aa5b885d33e1eb">&#9670;&nbsp;</a></span>comparer_</h2>

<div class="memitem">
<div class="memproto">
      <table class="memname">
        <tr>
          <td class="memname"><a class="el" href="class_s_p_h_1_1_int_comparer.html">IntComparer</a> SPH::Node::comparer_</td>
        </tr>
      </table>
</div><div class="memdoc">
<p>Comparer for sorting. </p>

</div>
</div>
<a id="ace46ca6baedae3f8df436e5606c20caf"></a>
<h2 class="memtitle"><span class="permalink"><a href="#ace46ca6baedae3f8df436e5606c20caf">&#9670;&nbsp;</a></span>end_nodes_</h2>

<div class="memitem">
<div class="memproto">
      <table class="memname">
        <tr>
          <td class="memname"><a class="el" href="namespace_s_p_h.html#abae56fd7f25f13487c7943ce4681d0ce">IndexVector</a> SPH::Node::end_nodes_</td>
        </tr>
      </table>
</div><div class="memdoc">
<p>a list containing the indices of all end nodes (nodes that are not connected). </p>

</div>
</div>
<a id="aa7f2629949b9f07a0954146466ca782b"></a>
<h2 class="memtitle"><span class="permalink"><a href="#aa7f2629949b9f07a0954146466ca782b">&#9670;&nbsp;</a></span>kd_tree_</h2>

<div class="memitem">
<div class="memproto">
      <table class="memname">
        <tr>
          <td class="memname"><a class="el" href="class_s_p_h_1_1_k_d_tree.html">KDTree</a>* SPH::Node::kd_tree_</td>
        </tr>
      </table>
</div><div class="memdoc">
<p>a k-d tree to compute the distance from any point to the closest node in the tree, except from the brother and mother branches. It is used to check collision between branches. </p>

</div>
</div>
<a id="aa6ee05ea3705bc945c4130229eeea9bc"></a>
<h2 class="memtitle"><span class="permalink"><a href="#aa6ee05ea3705bc945c4130229eeea9bc">&#9670;&nbsp;</a></span>last_node_</h2>

<div class="memitem">
<div class="memproto">
      <table class="memname">
        <tr>
          <td class="memname"><a class="el" href="classint.html">int</a> SPH::Node::last_node_</td>
        </tr>
      </table>
</div><div class="memdoc">
<p>last added node. </p>

</div>
</div>
<a id="a18579b570d4f163829098c655350994b"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a18579b570d4f163829098c655350994b">&#9670;&nbsp;</a></span>nodes_</h2>

<div class="memitem">
<div class="memproto">
      <table class="memname">
        <tr>
          <td class="memname">std::vector&lt;Point&gt; SPH::Node::nodes_</td>
        </tr>
      </table>
</div><div class="memdoc">
<p>Attributes list of points containing the coordinates of the nodes. </p>

</div>
</div>
<a id="abe8bf9d8d414f5896e58b1cb52fbdf42"></a>
<h2 class="memtitle"><span class="permalink"><a href="#abe8bf9d8d414f5896e58b1cb52fbdf42">&#9670;&nbsp;</a></span>nodes_idx_</h2>

<div class="memitem">
<div class="memproto">
      <table class="memname">
        <tr>
          <td class="memname">std::vector&lt;<a class="el" href="classint.html">int</a>&gt; SPH::Node::nodes_idx_</td>
        </tr>
      </table>
</div><div class="memdoc">
<p>lists of the node index. </p>

</div>
</div>
<hr/>The documentation for this class was generated from the following files:<ul>
<li>SPHINXsys/src/shared/network/<a class="el" href="network_8h_source.html">network.h</a></li>
<li>SPHINXsys/src/for_2D_build/network/network_supplementary.cpp</li>
<li>SPHINXsys/src/shared/network/network.cpp</li>
</ul>
</div><!-- contents -->
<!-- start footer part -->
<hr class="footer"/><address class="footer"><small>
Generated by &#160;<a href="http://www.doxygen.org/index.html">
<img class="footer" src="doxygen.png" alt="doxygen"/>
</a> 1.8.14
</small></address>
</body>
</html>
